Premature Convergence in Constrained Continuous Search Spaces
نویسنده
چکیده
The optimum of numerical problems quite often lies on the constraint boundary or even in a vertex of the feasible search space. In such cases the evolutionary algorithm (EA) frequently suffers from premature convergence because of a low success probability near the constraint boundaries. We analyze premature fitness stagnation and the success rates experimentally for an EA using self-adaptive step size control. For a (1+1)-EA with a Rechenberg-like step control mechanism we prove premature step size reduction at the constraint boundary. The proof is based on a success rate analysis considering a simplified mutation distribution model. From the success rates and the possible state transitions, the expected step size change can be derived at each step. We validate the theoretical model with an experimental analysis.
منابع مشابه
A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملOn The Convergence Of Modified Noor Iteration For Nearly Lipschitzian Maps In Real Banach Spaces
In this paper, we obtained the convergence of modified Noor iterative scheme for nearly Lipschitzian maps in real Banach spaces. Our results contribute to the literature in this area of re- search.
متن کاملPOINTWISE CONVERGENCE TOPOLOGY AND FUNCTION SPACES IN FUZZY ANALYSIS
We study the space of all continuous fuzzy-valued functions from a space $X$ into the space of fuzzy numbers $(mathbb{E}sp{1},dsb{infty})$ endowed with the pointwise convergence topology. Our results generalize the classical ones for continuous real-valued functions. The field of applications of this approach seems to be large, since the classical case allows many known devices to be fi...
متن کاملBacktracking Search Algorithm with three constraint handling methods for constrained optimization problems
A new evolutionary algorithm, Backtracking Search Algorithm (BSA), is applied to solve constrained optimization problems. Three constraint handling methods are combined with BSA for constrained optimization problems; namely feasibility and dominance (FAD) rules, e-constrained method with fixed control way of e value and a proposed e-constrained method with self-adaptive control way of e value. ...
متن کاملUniform connectedness and uniform local connectedness for lattice-valued uniform convergence spaces
We apply Preuss' concept of $mbbe$-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly $mbbe$-connected if the only uniformly continuous mappings from the space to a space in the class $mbbe$ are the constant mappings. We develop the basic theory for $mbbe$-connected sets, including the product theorem. Furtherm...
متن کامل